Fast and Generalized Polynomial Time Memory Consistency Verification
نویسندگان
چکیده
The problem of verifying multi-threaded execution against the memory consistency model of a processor is known to be an NP hard problem. However polynomial time algorithms exist that detect almost all failures in such execution. These are often used in practice for microprocessor verification. We present a low complexity and fully parallelized algorithm to check program execution against the processor consistency model. In addition our algorithm is general enough to support a number of consistency models without any degradation in performance. An implementation of this algorithm is currently used in practice to verify processors in the post silicon stage for multiple architectures.
منابع مشابه
Linearization of M-LINC Systems Using GMP and Particle Swarm Optimization for Wireless Communications
In this paper, an efficient algorithm for the efficiency maximization of the multilevel linear amplification using nonlinear components (M-LINC) systems is proposed regarding the linearity of the system. In this algorithm, we use the generalized memory polynomial (GMP) to provide a behavioral model for the power amplifier (PA) and calculate the power spectral density (PSD) of the output signal ...
متن کاملThe Range and Roots Constraints: Specifying Counting and Occurrence Problems
We propose a simple declarative language for specifying a wide range of counting and occurrence constraints. This specification language is executable since it immediately provides a polynomial propagation algorithm. To illustrate the capabilities of this language, we specify a dozen global constraints taken from the literature. We observe one of three outcomes: we achieve generalized arc-consi...
متن کاملA Survey of Verification Techniques for Cache Coherence Protocols
In this paper, we present a comprehensive survey of various approaches for the verification of cache coherence protocols based on state enumeration, (symbolic) model checking and symbolic state models. Since these techniques search the state space of the protocol exhaustively, the amount of memory required to manipulate the state information and the verification time grow very fast with the num...
متن کاملA Fast Inverse Polynomial Reconstruction Method Based on Conformal Fourier Trans- Formation
A fast Inverse Polynomial Reconstruction Method (IPRM) is proposed to efficiently eliminate the Gibbs phenomenon in Fourier reconstruction of discontinuous functions. The framework of the fast IPRM is modified by reconstructing the function in discretized elements, then the Conformal Fourier Transform (CFT) and the Chirp Z-Transform (CZT) algorithms are applied to accelerate the evaluation of r...
متن کاملTowards a Unified Verification Theory for Various Memory Consistency Models
Memory consistency models (e.g., Total Store Ordering (TSO), Partial Store Ordering (PSO), and Relaxed Memory Ordering [7]) specify behaviors of shared memories that are simultaneously accessed by multiple threads. For example, consider the program (x = 1; y = 1) ∥ (r0 = y; r1 = x) that consists of two threads where ∥ denotes a parallel composition, r0 and r1 are thread-local variables, x and y...
متن کامل